Insensitivity in Discrete - Time Generalizedsemi - Markov Processes Allowing Multiple Eventsand
نویسندگان
چکیده
In this paper we treat a discrete-time generalized semi-Markov process in which simultaneous deaths of more than one lifetime and simultaneous arrivals are permitted and service scheduling is probabilistic. Necessary and suucient conditions for insensitivity are derived and a simple algorithmic procedure provided whereby the equilibrium probabilities can be furnished when insensitivity holds. Some particular cases of special interest are examined in detail.
منابع مشابه
Arrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملThe Lifetime Behavior of a New Discrete Time Mixed $delta$-shock Model
In this study, a mixed $delta$-shock model with discrete-time is defined by combining $delta$-shock and extreme shock models. In this model, a system with multiple states fails in two ways: first, when k interarrival times between two consecutive shocks with magnitude larger than the critical threshold $gamma$ are in $[delta_1, delta _2], delta_1 < delta _2$; and second, when the interarrival t...
متن کاملNonparametric Adaptive Control for Discrete - Time Markov Processes with Unbounded Costs under Average Criterion
We introduce average cost optimal adaptive policies in a class of discrete-time Markov control processes with Borel state and action spaces, allowing unbounded costs. The processes evolve according to the system equations xt+1 = F (xt, at, ξt), t = 1, 2, . . . , with i.i.d. R -valued random vectors ξt, which are observable but whose density ̺ is unknown.
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملOn $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes
In the present paper we investigate the $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes with general state spaces. We provide a necessary and sufficient condition for such processes to satisfy the $L_1$-weak ergodicity. Moreover, we apply the obtained results to establish $L_1$-weak ergodicity of quadratic stochastic processes.
متن کامل